Searching Game Trees in Parallel Using SSS
نویسندگان
چکیده
PARSSS* is a parallel formulation of SSS* that is suitable for shared-memory multiprocessor systems. It is based on the distributed tree search paradigm of Ferguson and Korf. The main difficulty in parallelizing SSS* lies in achieving proper coordination between processes running on different subtrees of the game tree. This has been resolved in PARSSS* by the use of a shared array which maintains summary information on all processes that are currently in execution. Problem-independent speed-up values for PARSSS* have been obtained experimentally. It is shown that an earlier algorithm of the authors, called ITERSSS*, which allows SSS* to run in restricted memory, can also be parallelized using the above scheme.
منابع مشابه
A Hybrid SSS*/Alpha-Beta Algorithm for Parallel Search of Game Trees
This paper explores the issues that arise when SSS'-like search algorithms are implemented in parallel. There is an important implicit assumption regarding the OPEN list of SSS* (and A*-like algorithms); those states which are guaranteed never to become part of an optimal solution are forced down into the OPEN list and never rise to the top for expansion. However. when multiple processors are i...
متن کاملSearching Informed Game Trees
Well-known algorithms for the evaluation of the minimax function in game trees are alpha-beta Knuth] and SSS* Stockman]. An improved version of SSS* is SSS-2 Pijls-1]. All these algorithms don't use any heuristic information on the game tree. In this paper the use of heuristic information is introduced into the alpha-beta and the SSS-2 algorithm. Extended versions of these algorithms are presen...
متن کاملMaking Best Use of Available Memory When Searching Game Trees
When searching game trees, Algorithm SSS* examines fewer terminal nodes than the alphabiata procedure, but has the disadvantage that the storage space required by it is much greater. ITERSSS* is a modified version of SSS* that does not suffer from this limitation. The memory M that is available for use by the OPEN list can be fed as a parameter to ITERSSS* at run time. For successful operation ...
متن کاملA Minimax Algorithm Faster than Alpha-Beta
We present two recursive state space search algorithms that are based on SSS* and Dual*. Both dominate Alpha-Beta on a node count basis and one of them is always faster in searching random trees. These results have been derived on arti cial game trees with negligible leaf node evaluation time. For practical applications with more complex leaf evaluation functions we conjecture that our recursiv...
متن کاملAnother View on the SSS* Algorithm
A new version of the SSS* algorithm for searching game trees is presented. This algorithm is built around two recursive procedures. It nds the minimax value of a game tree by rst establishing an upper bound to this value and then successively trying in a top down fashion to tighten this bound until the minimax value has been obtained. This approach has several advantages, most notably that the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989